Channel capacity of Moore automata
نویسندگان
چکیده
منابع مشابه
Channel Capacity of Moore Automata
Consider a finite network of arbitrarily interconnected Moore automata, as in Fig. 1, where the circles represent automata and an arrow from one circle to another indicates that the output symbols from the first automata are input symbols to the second (Moore, 1956). Further, suppose that the network acts as a communication channel from a Source to a Receiver, the " input automaton" accepting o...
متن کاملON THE CAPACITY OF EILENBERG-MACLANE AND MOORE SPACES
K. Borsuk in 1979, at the Topological Conference in Moscow, introduced concept of the capacity of a compactum and asked some questions concerning properties of the capacity ofcompacta. In this paper, we give partial positive answers to three of these questions in some cases. In fact, by describing spaces homotopy dominated by Moore and Eilenberg-MacLane spaces, the capacities of a Moore space $...
متن کاملAbout the Size of Boyer-moore Automata
We study the size of Boyer-Moore automata introduced in Knuth, Morris & Pratt's famous paper on pattern matching. We experimentally exhibit a nite class of binary patterns, which produce large Boyer-Moore automata. The best approximation curve for their sizes is a polynomial O(m 7), or even an exponential O(2 0:4m), in the length m of the patterns. All the previously known maximal sizes were at...
متن کاملControl of Flexible-Manufacturing Workcells Using Extended Moore Automata
The modeling and control flexible-manufacturing workcells (FMCs) has generally been performed in a hierarchical structure, where at the highest level they have been modeled as discrete-event systems (DESs). In this paper, a new DES control synthesis technique that combines Moore Automata (MA) and ControlledAutomata theories to synthesize supervisors is presented. The obtained supervisors can mo...
متن کاملOn Moore Tree Automata and In nite Leaf Alphabets
Innnite leaf alphabets provide a new approach to remove the connection between the sizes of the leaf alphabet and the set of states of a tree automaton. Unique minimal tree automata can be constructed for classes of tree automata; however, such a class cannot be nite.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1968
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(68)90496-8